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 10, 2026 03:09Josu San MartinJosu San MartinScore: 4,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:104,63453,221,06037,387,0001,077,0002,473,984
2May 10, 2026 03:104,63857,016,89837,287,0001,213,0002,478,080
3May 10, 2026 03:104,64452,317,33237,470,0001,076,0002,473,984
4May 10, 2026 03:104,66955,416,32937,583,0001,172,0002,473,984
5May 10, 2026 03:104,71757,272,97937,958,0001,197,0002,473,984
6May 10, 2026 03:104,72451,968,60238,058,0001,157,0002,478,080
7May 10, 2026 03:104,76058,347,21538,320,0001,195,0002,469,888
8May 10, 2026 03:104,76953,690,54538,406,0001,177,0002,478,080
9May 10, 2026 03:104,80155,667,08138,724,0001,125,0002,469,888