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 21, 2026 01:13cashkarucashkaruScore: 69,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 01:1369,948611,557,969578,577,0001,998,0002,502,656
2Apr 21, 2026 01:1369,951613,575,235577,599,0002,997,0002,506,752
3Apr 21, 2026 01:1369,957612,631,851577,652,0002,998,0002,494,464
4Apr 21, 2026 01:1369,973613,462,302577,780,0002,998,0002,502,656
5Apr 21, 2026 01:1369,985605,480,122577,882,0002,999,0002,506,752
6Apr 21, 2026 01:1370,004604,587,639579,039,0002,000,0002,506,752
7Apr 21, 2026 01:1370,020607,534,484580,167,0001,000,0002,490,368
8Apr 21, 2026 01:1370,037608,421,429580,308,0001,000,0002,273,280
9Apr 21, 2026 01:1370,067605,451,982579,562,0001,998,0002,494,464