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 listJun 21, 2026 20:39A_ShamanA_ShamanScore: 47,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 20:4047,654404,605,399322,685,00072,849,0002,113,536
2Jun 21, 2026 20:4047,672404,772,629322,606,00073,077,0002,113,536
3Jun 21, 2026 20:4047,696405,094,829322,756,00073,123,0002,113,536
4Jun 21, 2026 20:4047,729405,365,482322,147,00074,010,0002,113,536
5Jun 21, 2026 20:4047,743405,439,435322,462,00073,805,0002,113,536
6Jun 21, 2026 20:4047,805405,861,490323,013,00073,773,0002,113,536
7Jun 21, 2026 20:4049,280418,150,807327,580,00081,449,0002,113,536
8Jun 21, 2026 20:4049,318418,434,807327,603,00081,738,0002,113,536
9Jun 21, 2026 20:4049,571420,532,418327,549,00083,896,0002,113,536