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 11, 2026 18:19Victor MerckléVictor MerckléScore: 3,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 18:203,83040,201,17830,740,0001,049,0002,113,536
2Aug 11, 2026 18:203,83840,237,96030,808,0001,055,0002,113,536
3Aug 11, 2026 18:203,84940,339,28830,883,0001,070,0002,113,536
4Aug 11, 2026 18:203,85140,437,54730,824,0001,141,0002,113,536
5Aug 11, 2026 18:203,85440,367,50930,953,0001,038,0002,113,536
6Aug 11, 2026 18:203,87840,608,71131,047,0001,148,0002,113,536
7Aug 11, 2026 18:203,96741,302,60131,910,0001,018,0002,113,536
8Aug 11, 2026 18:204,05442,079,37232,622,0001,030,0002,113,536
9Aug 11, 2026 18:204,09942,440,57432,991,0001,033,0002,113,536