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 listMar 23, 2026 02:42Alyssa VerkadeAlyssa VerkadeScore: 111,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 02:42110,812944,332,666689,804,000229,934,0002,301,952
2Mar 23, 2026 02:42110,892945,825,650688,552,000231,849,0002,482,176
3Mar 23, 2026 02:42110,933950,540,277689,806,000230,935,0002,498,560
4Mar 23, 2026 02:42110,971948,162,342689,299,000231,764,0002,281,472
5Mar 23, 2026 02:42111,010947,123,136688,540,000232,844,0002,273,280
6Mar 23, 2026 02:42111,034951,563,402689,688,000231,895,0002,383,872
7Mar 23, 2026 02:42111,044952,203,594689,750,000231,916,0002,453,504
8Mar 23, 2026 02:42111,124947,099,468690,501,000231,832,0002,424,832
9Mar 23, 2026 02:42111,220949,151,616689,349,000233,779,0002,473,984