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 18, 2026 04:13wnwnScore: 6,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 04:136,53082,230,87052,195,0002,007,0002,494,464
2Apr 18, 2026 04:136,58879,453,04053,669,0001,012,0002,277,376
3Apr 18, 2026 04:136,60880,618,48652,849,0001,994,0002,277,376