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 30, 2026 21:17Josu San MartinJosu San MartinScore: 4,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:174,25443,782,76234,282,0001,034,0002,113,536
2Aug 30, 2026 21:174,25743,822,06234,298,0001,042,0002,113,536
3Aug 30, 2026 21:174,26343,837,59134,348,0001,038,0002,113,536
4Aug 30, 2026 21:174,26643,928,16234,372,0001,042,0002,113,536
5Aug 30, 2026 21:174,28343,997,28634,439,0001,111,0002,113,536
6Aug 30, 2026 21:174,29444,073,23734,530,0001,115,0002,113,536
7Aug 30, 2026 21:174,29944,187,24134,575,0001,108,0002,113,536
8Aug 30, 2026 21:174,31752,937,57034,682,0001,152,0002,113,536
9Aug 30, 2026 21:174,32944,347,70334,895,0001,036,0002,113,536