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 10, 2026 16:29arwdjarwdjScore: 37,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 16:2937,464337,010,266308,956,0001,999,0002,404,352
2Apr 10, 2026 16:2937,549347,718,509310,657,000998,0002,392,064
3Apr 10, 2026 16:2937,558336,602,227310,731,000999,0002,404,352
4Apr 10, 2026 16:2937,567339,927,318310,804,000999,0002,281,472
5Apr 10, 2026 16:2937,568337,952,177309,813,0001,998,0002,396,160
6Apr 10, 2026 16:2937,577338,366,052310,894,000999,0002,281,472
7Apr 10, 2026 16:2937,594344,758,563311,028,0001,000,0002,281,472
8Apr 10, 2026 16:2937,596338,560,500311,047,0001,000,0002,387,968
9Apr 10, 2026 16:2937,633341,063,591311,356,0001,001,0002,396,160