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 05:25Josu San MartinJosu San MartinScore: 7,230Success
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 05:257,16580,795,52358,463,0001,007,0002,273,280
2Jan 5, 2026 05:257,20782,871,05957,824,0001,993,0002,445,312
3Jan 5, 2026 05:257,20790,600,81957,823,0001,993,0002,441,216
4Jan 5, 2026 05:257,23077,444,71258,008,0002,000,0002,285,568
5Jan 5, 2026 05:257,23482,138,40058,043,0002,001,0002,445,312
6Jan 5, 2026 05:257,26679,851,02259,304,0001,005,0002,285,568