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 7, 2026 05:26wnwnScore: 3,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:273,27935,211,87126,200,0001,022,0002,113,536
2Jul 7, 2026 05:273,29435,163,61226,329,0001,017,0002,113,536
3Jul 7, 2026 05:273,29935,410,08226,381,0001,005,0002,113,536
4Jul 7, 2026 05:273,30535,504,74426,400,0001,035,0002,113,536
5Jul 7, 2026 05:273,30935,294,83226,456,0001,012,0002,113,536
6Jul 7, 2026 05:273,31535,379,19826,506,0001,010,0002,113,536
7Jul 7, 2026 05:273,38335,860,18227,066,0001,017,0002,113,536
8Jul 7, 2026 05:273,44237,106,15227,541,0001,035,0002,113,536
9Jul 7, 2026 05:273,47036,661,00027,798,0001,006,0002,113,536