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 27, 2026 01:04Code HintsCode HintsScore: 7,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 01:047,06667,625,55656,605,0002,051,0002,113,536
2Jun 27, 2026 01:047,07766,425,40355,656,0003,084,0002,113,536
3Jun 27, 2026 01:047,07766,523,41755,719,0003,027,0002,113,536
4Jun 27, 2026 01:047,08066,255,05455,641,0003,123,0002,113,536
5Jun 27, 2026 01:047,10266,528,52655,822,0003,132,0002,113,536
6Jun 27, 2026 01:047,11366,790,33455,948,0003,091,0002,113,536
7Jun 27, 2026 01:047,12766,707,55757,107,0002,053,0002,113,536
8Jun 27, 2026 01:047,17867,319,09556,524,0003,058,0002,113,536
9Jun 27, 2026 01:047,19667,797,08356,445,0003,283,0002,113,536