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 listJun 11, 2026 01:50Victor MerckléVictor MerckléScore: 8,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 01:517,92273,163,19663,622,0002,137,0002,113,536
2Jun 11, 2026 01:517,95073,395,66364,970,0001,023,0002,113,536
3Jun 11, 2026 01:518,03174,141,58865,651,0001,014,0002,113,536
4Jun 11, 2026 01:518,03274,354,57365,651,0001,015,0002,113,536
5Jun 11, 2026 01:518,06274,645,80864,897,0002,024,0002,113,536
6Jun 11, 2026 01:518,06274,404,55865,892,0001,029,0002,113,536
7Jun 11, 2026 01:518,14275,010,26066,564,0001,015,0002,113,536
8Jun 11, 2026 01:518,25576,207,58367,495,0001,025,0002,113,536
9Jun 11, 2026 01:518,28176,171,13067,720,0001,019,0002,113,536