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 listApr 13, 2026 19:06Yuriy LyfenkoYuriy LyfenkoScore: 4,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 19:064,34662,037,68034,067,0002,003,0002,535,424
2Apr 13, 2026 19:054,35061,861,32634,096,0002,005,0002,273,280
3Apr 13, 2026 19:054,35359,605,23634,120,0002,007,0002,273,280
4Apr 13, 2026 19:064,36658,535,18734,221,0002,013,0002,535,424
5Apr 13, 2026 19:064,37962,789,36535,338,0001,009,0002,535,424
6Apr 13, 2026 19:054,40265,001,00635,525,0001,015,0002,535,424