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 listJan 15, 2026 00:33Josu San MartinJosu San MartinScore: 6,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 02:255,91674,041,58147,102,0002,004,0002,523,136
2Jan 15, 2026 00:335,95476,807,87748,414,0001,008,0002,445,312
3Jan 30, 2026 02:255,99981,932,32748,795,000995,0002,277,376
4Jan 30, 2026 02:256,00674,351,09848,850,000996,0002,281,472
5Jan 15, 2026 00:336,05473,051,07549,241,0001,004,0002,285,568
6Jan 15, 2026 00:336,05775,843,16048,260,0002,010,0002,285,568
7Jan 30, 2026 02:256,08376,827,89249,484,0001,009,0002,527,232
8Jan 15, 2026 00:336,12177,577,81949,810,000996,0002,281,472
9Jan 30, 2026 02:256,14575,064,36050,002,0001,000,0002,273,280
10Jan 30, 2026 02:256,14872,536,81849,031,0002,001,0002,285,568
11Jan 15, 2026 00:336,15574,182,88849,087,0002,003,0002,441,216
12Jan 15, 2026 00:336,18472,496,59249,318,0002,013,0002,273,280