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 listJun 3, 2025 19:47thatmagicalcatthatmagicalcatScore: 294,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2025 19:47293,0832,462,773,2492,366,625,00065,961,0002,281,472
2Jun 3, 2025 19:47293,5832,467,314,2002,376,768,00059,968,0002,281,472
3Jun 3, 2025 19:47293,7132,463,721,5262,363,854,00073,964,0002,359,296
4Jun 3, 2025 19:47294,2922,469,663,8312,385,659,00056,967,0002,285,568
5Jun 3, 2025 19:47294,3782,473,838,4992,382,381,00060,958,0002,355,200
6Jun 3, 2025 19:47294,4342,466,357,0432,364,839,00078,961,0002,355,200
7Jun 3, 2025 19:47294,5882,468,523,0192,393,104,00051,980,0002,351,104
8Jun 3, 2025 19:47294,8002,470,209,4802,384,867,00061,970,0002,281,472
9Jun 3, 2025 19:47297,3852,496,347,6442,396,348,00071,950,0002,359,296