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 6, 2026 15:35merripiummerripiumScore: 77,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 15:3576,925647,629,158576,364,00062,120,0002,113,536
2Jun 6, 2026 15:3576,961647,979,856575,598,00063,184,0002,113,536
3Jun 6, 2026 15:3577,116649,128,996575,764,00064,304,0002,113,536
4Jun 6, 2026 15:3577,123649,569,235575,919,00064,207,0002,113,536
5Jun 6, 2026 15:3577,124649,415,364576,995,00063,142,0002,113,536
6Jun 6, 2026 15:3577,126649,163,741575,941,00064,205,0002,113,536
7Jun 6, 2026 15:3577,291650,638,319574,420,00067,100,0002,113,536
8Jun 6, 2026 15:3577,341651,086,288574,815,00067,121,0002,113,536
9Jun 6, 2026 15:3577,353651,143,891575,738,00066,292,0002,113,536