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 listApr 27, 2026 05:49wnwnScore: 3,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:503,40244,009,90427,230,0001,008,0002,478,080
2Apr 27, 2026 05:503,40445,270,00227,252,0001,009,0002,482,176
3Apr 27, 2026 05:503,44549,490,09027,579,0001,021,0002,490,368
4Apr 27, 2026 05:503,45747,195,85226,722,0001,979,0002,486,272
5Apr 27, 2026 05:503,46946,226,88826,811,0001,986,0002,482,176
6Apr 27, 2026 05:503,47245,943,19326,831,0001,987,0002,486,272
7Apr 27, 2026 05:503,48950,089,28926,966,0001,997,0002,494,464
8Apr 27, 2026 05:503,58745,701,62327,792,0001,985,0002,482,176
9Apr 27, 2026 05:503,63347,964,07229,149,0001,005,0002,494,464