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 listJul 16, 2026 08:04wnwnScore: 3,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 08:053,68938,720,67629,591,0001,030,0002,113,536
2Jul 16, 2026 08:053,69138,574,17229,612,0001,025,0002,113,536
3Jul 16, 2026 08:053,69638,612,39229,657,0001,023,0002,113,536
4Jul 16, 2026 08:053,69938,737,59329,684,0001,024,0002,113,536
5Jul 16, 2026 08:053,69938,883,43229,674,0001,032,0002,113,536
6Jul 16, 2026 08:053,70238,890,98729,727,0001,002,0002,113,536
7Jul 16, 2026 08:053,70638,959,84729,730,0001,038,0002,113,536
8Jul 16, 2026 08:053,76839,460,22230,272,0001,006,0002,113,536
9Jul 16, 2026 08:053,86540,233,35031,075,0001,012,0002,113,536