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 listMay 5, 2026 17:03flavio87flavio87Score: 15,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 17:0315,685146,865,346127,974,0002,217,0002,396,160
2May 5, 2026 17:0315,772146,813,503128,707,0002,205,0002,412,544
3May 5, 2026 17:0315,833146,772,302129,162,0002,256,0002,396,160
4May 5, 2026 17:0315,847148,238,772129,364,0002,174,0002,404,352
5May 5, 2026 17:0315,853147,421,050129,371,0002,216,0002,392,064
6May 5, 2026 17:0315,864148,443,021129,476,0002,199,0002,392,064
7May 5, 2026 17:0315,882148,253,779129,620,0002,207,0002,322,432
8May 5, 2026 17:0315,967147,157,768130,346,0002,181,0002,437,120
9May 5, 2026 17:0316,287150,075,355133,009,0002,175,0002,424,832