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 listJul 16, 2026 10:49Daniel MastalerzDaniel MastalerzScore: 4,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 10:504,29246,886,36434,559,0001,067,0002,113,536
2Jul 16, 2026 10:504,29545,322,58034,600,0001,051,0002,113,536
3Jul 16, 2026 10:504,30345,510,73334,650,0001,071,0002,113,536
4Jul 16, 2026 10:504,30645,552,28934,666,0001,075,0002,113,536
5Jul 16, 2026 10:504,31045,541,21934,724,0001,056,0002,113,536
6Jul 16, 2026 10:504,31045,468,20234,738,0001,040,0002,113,536
7Jul 16, 2026 10:504,31145,503,33434,731,0001,053,0002,113,536
8Jul 16, 2026 10:504,31646,248,52634,770,0001,061,0002,113,536
9Jul 16, 2026 10:504,32345,661,20434,821,0001,060,0002,113,536