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 listSep 17, 2026 16:34Andrew EpsteinAndrew EpsteinScore: 175,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 16:40174,9451,462,311,8641,450,029,0002,015,0002,117,632stderr
2Sep 17, 2026 16:40175,2111,464,659,2381,452,243,0002,009,0002,117,632stderr
3Sep 17, 2026 16:40175,4241,466,329,0791,454,006,0002,018,0002,117,632stderr
4Sep 17, 2026 16:40175,8061,469,478,5841,457,064,0002,132,0002,117,632stderr
5Sep 17, 2026 16:40175,8721,470,126,8271,457,627,0002,111,0002,117,632stderr
6Sep 17, 2026 16:40176,0561,471,482,2701,460,269,0001,003,0002,117,632stderr
7Sep 17, 2026 16:40176,2061,474,018,9131,460,419,0002,091,0002,117,632stderr
8Sep 17, 2026 16:40176,4661,474,923,0991,462,674,0002,002,0002,117,632stderr
9Sep 17, 2026 16:40176,5311,475,481,5031,463,047,0002,161,0002,117,632stderr