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 18, 2026 09:57wnwnScore: 4,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 09:584,26460,617,45634,380,0001,011,0002,494,464
2Mar 18, 2026 09:574,26759,427,92034,403,0001,011,0002,490,368
3Mar 18, 2026 09:574,28765,269,76334,565,0001,016,0002,494,464
4Mar 18, 2026 09:584,29159,762,54034,596,0001,017,0002,490,368
5Mar 18, 2026 09:574,29461,209,69234,620,0001,018,0002,273,280
6Mar 18, 2026 09:574,31761,257,80734,836,000995,0002,273,280
7Mar 18, 2026 09:574,32060,372,60534,832,0001,024,0002,273,280
8Mar 18, 2026 09:574,32066,018,29733,863,0001,991,0002,502,656
9Mar 18, 2026 09:584,33156,776,47533,952,0001,997,0002,273,280