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 18, 2026 18:25wnwnScore: 7,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:256,41075,228,16751,199,0002,007,0002,404,352
2Feb 18, 2026 18:256,45981,113,58151,590,0002,023,0002,506,752
3Feb 18, 2026 18:256,51579,413,05752,070,0002,002,0002,265,088
4Feb 18, 2026 18:257,50288,742,21459,251,0003,012,0002,437,120
5Feb 18, 2026 18:257,60788,051,59562,137,0001,002,0002,502,656
6Feb 18, 2026 18:257,64890,664,13262,472,0001,007,0002,359,296