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 listSep 28, 2026 07:15Karthik ReddyKarthik ReddyScore: 4,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 07:154,63648,903,71037,446,0001,038,0002,113,536
2Sep 28, 2026 07:154,64248,840,84237,507,0001,028,0002,113,536
3Sep 28, 2026 07:154,78049,904,73738,637,0001,041,0002,113,536
4Sep 28, 2026 07:154,78450,050,61038,676,0001,032,0002,113,536
5Sep 28, 2026 07:154,80450,161,42438,851,0001,027,0002,113,536
6Sep 28, 2026 07:154,80950,300,65938,872,0001,048,0002,113,536
7Sep 28, 2026 07:154,81650,285,32138,929,0001,044,0002,113,536
8Sep 28, 2026 07:154,82351,542,84738,993,0001,043,0002,113,536
9Sep 28, 2026 07:154,85950,635,10339,126,0001,211,0002,113,536