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 21, 2026 18:07C21C21Score: 19,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 18:0919,214169,894,388158,329,0001,148,0002,113,536
2Sep 21, 2026 18:0919,215170,663,342158,249,0001,240,0002,113,536
3Sep 21, 2026 18:0919,216169,868,138158,336,0001,163,0002,113,536
4Sep 21, 2026 18:0919,227170,767,923158,336,0001,254,0002,113,536
5Sep 21, 2026 18:0919,227170,037,897158,348,0001,237,0002,113,536
6Sep 21, 2026 18:0919,230170,792,150158,379,0001,232,0002,113,536
7Sep 21, 2026 18:0919,232170,781,413158,378,0001,249,0002,113,536
8Sep 21, 2026 18:0919,236171,340,650158,403,0001,257,0002,113,536
9Sep 21, 2026 18:0919,237170,133,140158,430,0001,245,0002,113,536