Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 23, 2026 18:59Kacper GrzybowskiKacper GrzybowskiScore: 530,041Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 18:59529,5574,422,195,7134,338,362,00056,965,0002,277,376
2Feb 23, 2026 18:59529,6944,424,430,6554,307,515,00088,948,0002,383,872
3Feb 23, 2026 18:59529,8114,428,517,1734,328,469,00068,959,0002,277,376
4Feb 23, 2026 18:59530,0204,430,250,1534,328,197,00070,970,0002,277,376
5Feb 23, 2026 18:59530,0414,433,106,3244,335,363,00063,975,0002,289,664
6Feb 23, 2026 18:59530,0684,430,729,2594,339,602,00059,966,0002,277,376
7Feb 23, 2026 18:59530,2094,427,156,2614,337,770,00062,967,0002,387,968
8Feb 23, 2026 18:59530,2174,427,200,6204,326,840,00073,963,0002,383,872
9Feb 23, 2026 18:59530,3044,433,802,7344,338,562,00062,964,0002,277,376