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 20, 2026 15:24BenBenScore: 30,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:2530,317277,445,395186,731,00064,906,0002,334,720
2Apr 20, 2026 15:2530,351279,486,087179,944,00071,977,0002,355,200
3Apr 20, 2026 15:2530,392276,493,369184,186,00068,069,0002,326,528