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 21:00Elijah KinElijah KinScore: 49,989Success
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 21:0248,556428,587,113401,014,0002,000,0002,265,088
2Mar 23, 2026 21:0248,679429,663,010403,036,0001,000,0002,527,232
3Mar 23, 2026 21:0248,713435,994,931404,321,00002,265,088
4Mar 23, 2026 21:0149,988446,322,350413,905,000999,0002,265,088
5Mar 23, 2026 21:0149,989445,768,963412,906,0001,999,0002,265,088
6Mar 23, 2026 21:0150,019438,072,745414,156,0001,000,0002,523,136
7Mar 23, 2026 21:0063,379550,354,862525,044,0001,000,0002,379,776
8Mar 23, 2026 21:0063,685554,346,115527,586,000999,0002,523,136
9Mar 23, 2026 21:0063,854554,524,843529,987,00002,379,776