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 14, 2026 21:41wnwnScore: 4,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:414,23857,018,04233,166,0002,010,0002,273,280
2Mar 14, 2026 21:414,24558,430,54333,219,0002,013,0002,498,560
3Mar 14, 2026 21:414,24755,657,18834,245,0001,007,0002,273,280
4Mar 14, 2026 21:414,25255,893,98834,282,0001,008,0002,273,280
5Mar 14, 2026 21:414,25358,678,68634,288,0001,008,0002,498,560
6Mar 14, 2026 21:414,25857,539,92134,333,0001,009,0002,273,280
7Mar 14, 2026 21:414,27560,297,00334,467,0001,013,0002,490,368
8Mar 14, 2026 21:414,29060,506,18634,589,0001,017,0002,498,560
9Mar 14, 2026 21:414,33559,460,39933,979,0001,998,0002,490,368