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 listSep 3, 2026 22:14Josu San MartinJosu San MartinScore: 63,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:1563,630538,214,748469,767,00058,370,0002,113,536
2Sep 3, 2026 22:1563,656538,283,805469,736,00058,612,0002,113,536
3Sep 3, 2026 22:1563,686538,499,285469,995,00058,600,0002,113,536
4Sep 3, 2026 22:1563,704538,762,155469,949,00058,802,0002,113,536
5Sep 3, 2026 22:1563,732538,982,900469,680,00059,303,0002,113,536
6Sep 3, 2026 22:1563,734539,016,511469,765,00059,231,0002,113,536
7Sep 3, 2026 22:1563,756539,144,003469,966,00059,217,0002,113,536
8Sep 3, 2026 22:1563,763539,123,838470,065,00059,176,0002,113,536
9Sep 3, 2026 22:1563,771539,307,051469,103,00060,201,0002,113,536