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 listOct 14, 2024 16:54Joad NacerJoad NacerScore: 4,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 16:544,24259,602,16034,201,0001,005,0002,310,144
2Oct 14, 2024 16:534,27159,566,09732,415,0003,038,0002,535,424
3Oct 14, 2024 16:534,27658,123,05632,446,0003,041,0002,273,280
4Oct 14, 2024 16:544,31762,231,35934,834,000995,0002,535,424
5Oct 14, 2024 16:534,31860,762,95734,844,000995,0002,297,856
6Oct 14, 2024 16:534,33156,193,06833,952,0001,997,0002,531,328
7Oct 14, 2024 16:544,33457,434,38234,974,000999,0002,531,328
8Oct 14, 2024 16:534,33960,374,04034,012,0002,000,0002,531,328
9Oct 14, 2024 16:544,35257,127,78234,116,0002,006,0002,293,760
10Oct 14, 2024 16:544,35954,761,50136,183,00002,310,144
11Oct 14, 2024 16:544,37761,378,66433,299,0003,027,0002,310,144
12Oct 14, 2024 16:534,37858,512,64734,318,0002,018,0002,310,144