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 listAug 2, 2026 17:51boop34boop34Score: 10,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:5110,842100,770,83888,977,0001,018,0002,113,536
2Aug 2, 2026 17:5110,850100,808,92689,040,0001,017,0002,113,536
3Aug 2, 2026 17:5110,851100,830,14689,047,0001,018,0002,113,536
4Aug 2, 2026 17:5110,853100,059,93489,063,0001,017,0002,113,536
5Aug 2, 2026 17:5110,859100,867,36789,113,0001,017,0002,113,536
6Aug 2, 2026 17:5110,865100,182,82489,165,0001,017,0002,113,536
7Aug 2, 2026 17:5110,866100,935,63989,177,0001,016,0002,113,536
8Aug 2, 2026 17:5110,873101,077,73889,233,0001,017,0002,113,536
9Aug 2, 2026 17:5110,877100,801,26489,269,0001,016,0002,113,536