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 listFeb 11, 2026 19:22olliecrowolliecrowScore: 13,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:2213,537145,346,864109,348,0003,009,0002,269,184
2Feb 11, 2026 19:2213,587143,062,674110,774,0001,995,0002,404,352
3Feb 11, 2026 19:2214,430145,327,680116,775,0002,994,0002,273,280