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 listNov 1, 2026 19:43Dinu GoyalDinu GoyalScore: 14,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 19:4314,047127,463,258115,413,0001,183,0002,113,536
2Nov 1, 2026 19:4314,097127,815,002115,822,0001,184,0002,113,536
3Nov 1, 2026 19:4314,135128,176,950116,150,0001,173,0002,113,536
4Nov 1, 2026 19:4314,197128,655,964116,525,0001,317,0002,113,536
5Nov 1, 2026 19:4314,228128,963,595116,578,0001,521,0002,113,536
6Nov 1, 2026 19:4314,289129,402,114117,285,0001,317,0002,113,536
7Nov 1, 2026 19:4314,454130,857,850115,591,0004,385,0002,113,536
8Nov 1, 2026 19:4314,496131,721,505115,835,0004,483,0002,113,536
9Nov 1, 2026 19:4314,594132,535,170116,597,0004,534,0002,113,536