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 listJul 10, 2026 12:34boop34boop34Score: 65,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 12:3565,027549,769,983537,633,0002,095,0002,113,536
2Jul 10, 2026 12:3565,061550,279,614537,977,0002,035,0002,113,536
3Jul 10, 2026 12:3565,134550,957,658538,598,0002,021,0002,113,536
4Jul 10, 2026 12:3565,176551,284,932538,831,0002,132,0002,113,536
5Jul 10, 2026 12:3565,178551,230,974538,950,0002,029,0002,113,536
6Jul 10, 2026 12:3565,201551,460,294539,052,0002,119,0002,113,536
7Jul 10, 2026 12:3565,207551,501,872539,091,0002,128,0002,113,536
8Jul 10, 2026 12:3565,237551,047,400539,411,0002,060,0002,113,536
9Jul 10, 2026 12:3565,257551,664,299539,610,0002,030,0002,113,536