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 listJan 5, 2026 20:46lipapipalipapipaScore: 68,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 20:4668,453593,809,508505,145,00063,018,000307,200
2Jan 5, 2026 20:4668,513590,394,257504,581,00064,073,000311,296
3Jan 5, 2026 20:4668,739597,525,302503,586,00066,945,000303,104
4Jan 5, 2026 20:4668,851597,455,258501,529,00069,934,000176,128
5Jan 5, 2026 20:4668,962598,356,604509,451,00062,932,000303,104
6Jan 5, 2026 20:4671,116613,365,686514,359,00075,905,000299,008
7Jan 5, 2026 20:4671,252618,101,900513,471,00077,919,0002,408,448
8Jan 5, 2026 20:4671,442623,237,699515,103,00077,864,000176,128
9Jan 5, 2026 20:4671,678619,645,072515,073,00079,856,000307,200