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 listMar 9, 2026 02:50olliecrowolliecrowScore: 5,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 02:505,21172,217,04340,238,0003,017,0002,433,024
2Mar 9, 2026 02:505,24064,320,92340,457,0003,034,0002,506,752
3Mar 9, 2026 02:505,24165,756,67239,453,0004,046,0002,424,832
4Mar 9, 2026 02:505,25168,237,31541,559,0002,027,0002,392,064
5Mar 9, 2026 02:505,37773,618,67541,590,0003,043,0002,330,624
6Mar 9, 2026 02:505,39867,506,47944,803,00002,306,048
7Mar 9, 2026 02:505,39869,555,19542,816,0001,991,0002,363,392
8Mar 9, 2026 02:505,40068,406,70141,829,0002,987,0002,490,368
9Mar 9, 2026 02:505,41772,367,06341,967,0002,997,0002,392,064
10Mar 9, 2026 02:505,57178,816,16644,228,0002,010,0002,322,432
11Mar 9, 2026 02:505,67976,929,62345,131,0002,005,0002,473,984
12Mar 9, 2026 02:505,83975,612,24745,433,0003,028,0002,506,752