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 listApr 18, 2026 10:06wnwnScore: 5,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 08:145,61674,070,23345,603,0001,013,0002,277,376
2Apr 18, 2026 08:145,61973,966,73345,623,0001,013,0002,277,376
3Apr 18, 2026 10:065,61975,241,96145,627,0001,013,0002,494,464
4Apr 18, 2026 10:065,62080,256,99345,631,0001,014,0002,277,376
5Apr 18, 2026 08:145,62573,866,81845,674,0001,014,0002,498,560
6Apr 18, 2026 10:065,67372,283,96245,087,0002,003,0002,490,368