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 13, 2026 17:42M-RochatM-RochatScore: 20,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:4220,000176,441,994164,997,0001,003,0002,113,536
2May 13, 2026 17:4220,052175,156,379165,432,0001,004,0002,113,536
3May 13, 2026 17:4220,144175,897,874166,196,0001,005,0002,113,536
4May 13, 2026 17:4220,175177,898,916166,450,0001,006,0002,113,536
5May 13, 2026 17:4220,296178,911,084167,451,0001,007,0002,113,536
6May 13, 2026 17:4220,306179,035,559167,536,0001,004,0002,113,536
7May 13, 2026 17:4220,347179,614,621167,877,0001,004,0002,113,536
8May 13, 2026 17:4220,376178,671,746168,122,0001,004,0002,113,536
9May 13, 2026 17:4221,703190,960,017179,134,0001,004,0002,113,536