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 04:16Josu San MartinJosu San MartinScore: 7,325Success
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 04:167,06883,011,64857,653,0001,011,0002,441,216
2Jan 5, 2026 04:167,20383,478,81657,794,0001,992,0002,285,568
3Jan 5, 2026 04:167,23081,708,49758,010,0002,000,0002,285,568
4Jan 5, 2026 04:167,32585,993,52558,804,0001,993,0002,273,280
5Jan 5, 2026 04:167,33785,135,06058,897,0001,996,0002,519,040
6Jan 5, 2026 04:167,34982,394,34358,996,0001,999,0002,535,424