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:57M-RochatM-RochatScore: 12,652Success
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:5812,627114,061,834102,667,0002,142,0002,113,536
2May 17, 2026 01:5812,642114,046,475101,822,0003,114,0002,113,536
3May 17, 2026 01:5812,643114,672,463102,775,0002,163,0002,113,536
4May 17, 2026 01:5812,646115,808,689102,812,0002,151,0002,113,536
5May 17, 2026 01:5812,652115,517,714102,890,0002,129,0002,113,536
6May 17, 2026 01:5812,665115,920,632102,958,0002,168,0002,113,536
7May 17, 2026 01:5812,713117,145,673102,363,0003,158,0002,113,536
8May 17, 2026 01:5812,744117,349,172102,479,0003,299,0002,113,536
9May 17, 2026 01:5812,774117,481,869102,745,0003,280,0002,113,536