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 listApr 13, 2026 01:17Josu San MartinJosu San MartinScore: 5,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 01:175,51969,654,61843,816,0001,991,0002,502,656
2Apr 13, 2026 01:175,71873,860,49546,449,0001,009,0002,285,568
3Apr 13, 2026 01:175,90869,992,64447,035,0002,001,0002,404,352
4Apr 13, 2026 01:175,91369,416,88147,076,0002,003,0002,285,568
5Apr 13, 2026 01:175,94375,487,62648,320,0001,006,0002,285,568
6Apr 13, 2026 01:176,02178,822,72448,976,000999,0002,285,568