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 6, 2026 15:42Danylo MocherniukDanylo MocherniukScore: 6,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 15:426,18872,903,02649,346,0002,014,0002,293,760
2Apr 6, 2026 15:426,20872,827,52151,523,00002,293,760
3Apr 6, 2026 15:426,21075,504,43550,537,0001,010,0002,293,760
4Apr 6, 2026 15:426,22380,411,01451,655,00002,293,760
5Apr 6, 2026 15:426,22575,403,59450,656,0001,013,0002,420,736
6Apr 6, 2026 15:426,24479,070,66251,822,00002,293,760
7Apr 6, 2026 15:426,26175,174,51749,970,0001,998,0002,428,928
8Apr 6, 2026 15:426,34077,047,05450,598,0002,023,0002,428,928
9Apr 6, 2026 15:426,40076,703,35252,119,0001,002,0002,293,760