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 30, 2026 18:04Genos0Genos0Score: 89,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 18:0689,069748,573,966679,846,00059,431,0002,113,536
2Jun 30, 2026 18:0689,083748,808,634679,931,00059,466,0002,113,536
3Jun 30, 2026 18:0689,085748,766,735679,877,00059,531,0002,113,536
4Jun 30, 2026 18:0689,113749,022,593679,709,00059,935,0002,113,536
5Jun 30, 2026 18:0689,120749,058,783680,026,00059,670,0002,113,536
6Jun 30, 2026 18:0689,120749,005,348680,239,00059,461,0002,113,536
7Jun 30, 2026 18:0689,128749,020,581680,047,00059,718,0002,113,536
8Jun 30, 2026 18:0689,206749,700,876680,132,00060,285,0002,113,536
9Jun 30, 2026 18:0689,229751,825,408680,418,00060,189,0002,113,536