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 17, 2026 02:09Andrew EpsteinAndrew EpsteinScore: 3,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:103,41737,148,70427,258,0001,109,0002,113,536
2Sep 17, 2026 02:103,43637,383,78027,423,0001,103,0002,113,536
3Sep 17, 2026 02:103,46437,613,87827,656,0001,103,0002,113,536
4Sep 17, 2026 02:103,49537,874,21427,951,0001,061,0002,113,536
5Sep 17, 2026 02:103,53938,202,33028,296,0001,081,0002,113,536
6Sep 17, 2026 02:103,55038,301,83828,356,0001,109,0002,113,536
7Sep 17, 2026 02:103,55538,249,47128,399,0001,114,0002,113,536
8Sep 17, 2026 02:103,57638,518,20128,569,0001,112,0002,113,536
9Sep 17, 2026 02:103,58538,573,32528,665,0001,096,0002,113,536