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 listMay 17, 2026 01:56M-RochatM-RochatScore: 12,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:5712,713116,381,028103,269,0002,252,0002,113,536
2May 17, 2026 01:5712,721116,285,304102,395,0003,195,0002,113,536
3May 17, 2026 01:5712,721114,377,476103,381,0002,207,0002,113,536
4May 17, 2026 01:5712,746115,497,156102,623,0003,171,0002,113,536
5May 17, 2026 01:5712,753115,258,439102,634,0003,219,0002,113,536
6May 17, 2026 01:5712,754116,451,900102,688,0003,177,0002,113,536
7May 17, 2026 01:5712,761114,722,644102,751,0003,171,0002,113,536
8May 17, 2026 01:5712,761115,858,084102,635,0003,288,0002,113,536
9May 17, 2026 01:5712,766115,612,657102,456,0003,509,0002,113,536