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 2, 2026 06:25Josu San MartinJosu San MartinScore: 7,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 06:257,33388,643,34858,867,0001,995,0002,441,216
2Jan 2, 2026 06:257,40383,247,97258,427,0003,022,0002,289,664
3Jan 2, 2026 06:257,56688,366,01060,805,0001,993,0002,334,720