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 24, 2026 21:02Karthik ReddyKarthik ReddyScore: 25,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 21:0325,067218,335,451207,045,0001,014,0002,113,536
2Sep 24, 2026 21:0325,073219,023,331207,104,0001,009,0002,113,536
3Sep 24, 2026 21:0325,086218,481,997207,209,0001,009,0002,113,536
4Sep 24, 2026 21:0325,095218,531,827207,285,0001,010,0002,113,536
5Sep 24, 2026 21:0325,138219,506,970207,639,0001,009,0002,113,536
6Sep 24, 2026 21:0325,192219,437,593208,084,0001,010,0002,113,536
7Sep 24, 2026 21:0325,199219,440,564208,149,0001,008,0002,113,536
8Sep 24, 2026 21:0325,258221,506,067208,637,0001,009,0002,113,536
9Sep 24, 2026 21:0325,297220,239,169208,968,0001,003,0002,113,536