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 listMay 20, 2026 05:36M-RochatM-RochatScore: 12,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:3612,501114,563,556101,410,0002,350,0002,113,536
2May 20, 2026 05:3612,533114,149,458101,701,0002,324,0002,113,536
3May 20, 2026 05:3612,540116,266,677101,759,0002,327,0002,113,536
4May 20, 2026 05:3612,550114,372,259102,163,0002,010,0002,113,536
5May 20, 2026 05:3612,560115,551,806102,244,0002,012,0002,113,536
6May 20, 2026 05:3612,560113,870,221101,894,0002,358,0002,113,536
7May 20, 2026 05:3612,647116,773,231102,892,0002,085,0002,113,536
8May 20, 2026 05:3612,653114,658,065102,970,0002,058,0002,113,536
9May 20, 2026 05:3612,681115,211,486103,197,0002,060,0002,113,536