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 listOct 5, 2026 02:17FrederickFrederickScore: 13,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:1813,377122,273,612110,018,0001,016,0002,113,536
2Oct 5, 2026 02:1813,404122,433,220110,243,0001,017,0002,113,536
3Oct 5, 2026 02:1813,423123,267,374110,400,0001,018,0002,113,536
4Oct 5, 2026 02:1813,428121,916,534110,440,0001,018,0002,113,536
5Oct 5, 2026 02:1813,540123,553,706111,372,0001,016,0002,113,536
6Oct 5, 2026 02:1813,543123,607,202111,398,0001,016,0002,113,536
7Oct 5, 2026 02:1813,547122,910,465111,426,0001,015,0002,113,536
8Oct 5, 2026 02:1813,548122,891,556111,438,0001,017,0002,113,536
9Oct 5, 2026 02:1813,548122,948,169111,434,0001,016,0002,113,536