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 31, 2026 02:31Josu San MartinJosu San MartinScore: 4,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 02:374,91749,158,59439,698,0001,116,0002,113,536
2Aug 31, 2026 02:374,92149,159,69339,726,0001,119,0002,113,536
3Aug 31, 2026 02:374,93049,261,37439,789,0001,131,0002,113,536
4Aug 31, 2026 02:374,93649,276,46739,858,0001,117,0002,113,536
5Aug 31, 2026 02:374,93649,436,35739,857,0001,114,0002,113,536
6Aug 31, 2026 02:374,98849,824,14340,279,0001,123,0002,113,536
7Aug 31, 2026 02:374,98949,767,28840,286,0001,126,0002,113,536
8Aug 31, 2026 02:375,00949,936,35540,453,0001,123,0002,113,536
9Aug 31, 2026 02:375,03650,866,42940,677,0001,128,0002,113,536