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 12, 2026 16:14Victor MerckléVictor MerckléScore: 9,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 16:149,42289,781,35377,110,0001,099,0002,113,536
2May 12, 2026 16:149,42488,518,44777,130,0001,092,0002,113,536
3May 12, 2026 16:149,43388,661,07377,119,0001,182,0002,113,536
4May 12, 2026 16:149,43588,418,22777,142,0001,174,0002,113,536
5May 12, 2026 16:149,43989,284,56177,159,0001,191,0002,113,536
6May 12, 2026 16:149,43989,316,85277,162,0001,188,0002,113,536
7May 12, 2026 16:149,44087,219,34677,165,0001,189,0002,113,536
8May 12, 2026 16:149,47388,945,73377,457,0001,171,0002,113,536
9May 12, 2026 16:149,50089,581,72877,686,0001,169,0002,113,536